A Henkin-Style Completeness Proof for the Modal Logic S5
نویسندگان
چکیده
This paper presents a recent formalization of Henkin-style completeness proof for the propositional modal logic S5 using Lean theorem prover. The formalized is close to that Hughes and Cresswell [], but system, based on different choice axioms, better described as Mendelson system augmented with axiom schemes K, T, S4, B, necessitation rule inference. language has false implication only primitive logical connectives necessity operator. full source code available online been typechecked 3.4.2.
منابع مشابه
A Henkin-Style Proof of Completeness for First-order Algebraizable Logics
This paper considers Henkin’s proof of completeness of classical first-order logic and extends its scope to the realm of algebraizable logics in the sense of Blok and Pigozzi. Given a propositional logic L (for which we only need to assume that it has an algebraic semantics L and a suitable disjunction) we axiomatize two natural firstorder extensions L∀ and L∀ and prove that the former is compl...
متن کاملA Resolution Method for Modal Logic S5
In this work, we aim to define a resolution method for the modal logic S5. We first propose a conjunctive normal form (S5-CNF) which is mainly based on using labels referring to semantic worlds. In a sense, S5-CNF can be seen as a generalization of the conjunctive normal form in propositional logic by including the modal connective of necessity and labels in the clause structure. We show that e...
متن کاملEfficient Representations for the Modal Logic S5
We investigate efficient representations of subjective formulas in the modal logic of knowledge, S5, and more generally of sets of sets of propositional assignments. One motivation for this study is contingent planning, for which many approaches use operations on such formulas, and can clearly take advantage of efficient representations. We study the language S5-DNF introduced by Bienvenu et al...
متن کاملKnowledge Compilation in the Modal Logic S5
In this paper, we study the knowledge compilation task for propositional epistemic logic S5. We first extend many of the queries and transformations considered in the classical knowledge compilation map to S5. We then show that the notion of disjunctive normal form (DNF) can be profitably extended to the epistemic case; we prove that the DNF fragment of S5, when appropriately defined, satisfies...
متن کاملA Deep Inference System for the Modal Logic S5
We present a cut-admissible system for the modal logic S5 in a framework that makes explicit and intensive use of deep inference. Deep inference is induced by the methods applied so far in conceptually pure systems for this logic. Thus, the formulation of a system in such a framework is an evolutional process and leads to positive proof theoretical results. The system enjoys systematicity and m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-89391-0_25